def haha(arr,n):
arr.sort()
i=0
while(i<n-2):
a=arr[i]
b=arr[i+1]
c=arr[i+2]
if(a+b>c and a+c>b and b+c>a):
return "YES"
i+=1
return "NO"
n=int(input())
arr=list(map(int,input().split()))
x=haha(arr,n)
print(x)#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool solve()
{
int n;
cin >> n;
ll num[n];
for(auto &x: num)
cin >> x;
sort(num, num+n);
for(int i = 0; i < n-2; i++)
{
if(num[i]+num[i+1] > num[i+2] && num[i]+num[i+2] > num[i+1] && num[i+1]+num[i+2] > num[i])
return true;
}
return false;
}
int main()
{
//freopen("a.in", "r", stdin);
(solve())? cout << "YES" : cout << "NO";
} 2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |